Almost k-wise Independent Variables
نویسنده
چکیده
We will now consider the problem of creating a set of bitstrings such that the bits are almost k-wise independent. Our method consists of two steps. In the first step we create a set of bitstrings such that parity on every fixed index set is almost even. In the second step we present a method to convert such a set into a set where the bits are almost k-wise independent. For presentational reasons we give the steps in reverse order, i.e., we start by showing how to create almost k-wise indpendent bitstrings from a set with almost even parity.
منابع مشابه
OBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملAlmost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any sequence of k distinct elements to any sequence of k distinct elements with equal probability. Efficient constructions of k-wise independent permutations are known for k = 2 and k = 3 based on multiply transitive permutation groups but are unknown for k≥ 4. In fact, it is known that the...
متن کاملLecture 5: k-wise Independent Hashing and Applications
If the random variables X1, X2, · · · , Xn are independent, they are k-wise independent for any k. However, the converse is not true as shown by the following example. Also, if k1 > k2, k1-wise independence implies k2-wise independence. Example 2. Let X1, X2 be uniform independent random variables taking values in {0, 1}. Let X3 = X1 ⊕X2. It is easy to check that {X1, X2, X3} is pairwise indepe...
متن کاملAlmost k-wise independence versus k-wise independence
We say that a distribution over {0, 1} is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. A natural question regarding ( , k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exists ( , k)-wise independent distribution whose statistical distance...
متن کاملDerandomizing Chernoff Bound with Union Bound with an Application to $k$-wise Independent Sets
Derandomization of Chernoff bound with union bound is already proven in many papers. We here give another explicit version of it that obtains a construction of size that is arbitrary close to the probabilistic nonconstructive size. We apply this to give a new simple polynomial time constructions of almost k-wise independent sets. We also give almost tight lower bounds for the size of k-wise ind...
متن کامل